The Chromatic Quasisymmetric Class Function of a Digraph
نویسندگان
چکیده
We introduce a quasisymmetric class function associated with group acting on double poset or directed graph. The latter is generalization of the chromatic digraph introduced by Ellzey, while former Grinberg. prove representation-theoretic analogues classical and recent results, including F-positivity, combinatorial reciprocity theorems. deduce results for orbital functions, study notion strongly flawless sequences.
منابع مشابه
A Quasisymmetric Function Generalization of the Chromatic Symmetric Function
The chromatic symmetric function XG of a graph G was introduced by Stanley. In this paper we introduce a quasisymmetric generalization X G called the k-chromatic quasisymmetric function of G and show that it is positive in the fundamental basis for the quasisymmetric functions. Following the specialization of XG to χG(λ), the chromatic polynomial, we also define a generalization χ k G(λ) and sh...
متن کاملThe circular chromatic number of a digraph
We introduce the circular chromatic number χc of a digraph and establish various basic results. They show that the coloring theory for digraphs is similar to the coloring theory for undirected graphs when independent sets of vertices are replaced by acyclic sets. Since the directed k-cycle has circular chromatic number k/(k − 1), for k ≥ 2, values of χc between 1 and 2 are possible. We show tha...
متن کاملPower Sum Expansion of Chromatic Quasisymmetric Functions
The chromatic quasisymmetric function of a graph was introduced by Shareshian and Wachs as a refinement of Stanley’s chromatic symmetric function. An explicit combinatorial formula, conjectured by Shareshian and Wachs, expressing the chromatic quasisymmetric function of the incomparability graph of a natural unit interval order in terms of power sum symmetric functions, is proven. The proof use...
متن کاملDigraph Girth via Chromatic Number
Let D be a digraph. The chromatic number χ(D) of D is the smallest number of colors needed to color the vertices of D such that every color class induces an acyclic subdigraph. The girth of D is the length of a shortest directed cycle, or ∞ if D is acyclic. Let G(k, n) be the maximum possible girth of a digraph on n vertices with χ(D) > k. It is shown that G(k, n) ≥ n1/k and G(k, n) ≤ (3 log2 n...
متن کاملChromatic Quasisymmetric Functions and Hessenberg Varieties
We discuss three distinct topics of independent interest; one in enumerative combinatorics, one in symmetric function theory, and one in algebraic geometry. The topic in enumerative combinatorics concerns a q-analog of a generalization of the Eulerian polynomials, the one in symmetric function theory deals with a refinement of the chromatic symmetric functions of Stanley, and the one in algebra...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Combinatorics
سال: 2021
ISSN: ['0219-3094', '0218-0006']
DOI: https://doi.org/10.1007/s00026-021-00556-1